Efficient Cluster Based Multicast Tree for Secure Multicast Communication for Mobile Ad Hoc Networks

Secure multicast communication in mobile adhoc networks is challenging due to its inherent characteristics of infrastructure-less architecture with lack of central authority, limited resources such as bandwidth, time and power. Hence key management is the fundamental challenge in achieving secure communication using multicast key distribution in mobile adhoc networks. In many multicast interactions, due to its frequent node mobility, new member can join and current members can leave at a time due to node failure which causes delay in multicast transmission. This paper proposes a new efficient cluster based multicast tree (CBMT) algorithm for secure multicast Communication, in which source node uses Multicast version of Destination Sequenced Distance Vector(MDSDV) routing protocol to collects its 1 hop neighbors to form cluster and each node which have child node is elected as the Local controllers of the created clusters. It also tolerates the faults that causes due to failure of nodes. Simulation results shows the demonstration of CBMT using MDSDV have better system performance in terms of end to end delay and fault tolerance rate under varying network conditions.